6

A note on the construction of the data structure “deap”

Year:
1989
Language:
english
File:
PDF, 360 KB
english, 1989
7

Splitmerge—A fast stable merging algorithm

Year:
1986
Language:
english
File:
PDF, 260 KB
english, 1986
12

PARALLEL CONSTRUCTIONS OF HEAPS AND MIN-MAX HEAPS

Year:
1992
Language:
english
File:
PDF, 420 KB
english, 1992
16

Average-case results on heapsort

Year:
1987
Language:
english
File:
PDF, 815 KB
english, 1987
21

Sublinear merging and natural mergesort

Year:
1993
Language:
english
File:
PDF, 973 KB
english, 1993
22

On partitions and presortedness of sequences

Year:
1992
Language:
english
File:
PDF, 820 KB
english, 1992
24

An optimal algorithm for deleting the root of a heap

Year:
1991
Language:
english
File:
PDF, 491 KB
english, 1991
25

Heaps with bits

Year:
1996
Language:
english
File:
PDF, 853 KB
english, 1996
28

The deap—a double-ended heap to implement double-ended priority queues

Year:
1987
Language:
english
File:
PDF, 363 KB
english, 1987
31

Construction of a tree from its traversals in optimal time and space

Year:
1990
Language:
english
File:
PDF, 430 KB
english, 1990
32

A general approach to dominance in the plane

Year:
1992
Language:
english
File:
PDF, 1.35 MB
english, 1992
33

Improving worst-case behavior of heaps

Year:
1984
Language:
english
File:
PDF, 237 KB
english, 1984
37

A variant of heapsort with almost optimal number of comparisons

Year:
1987
Language:
english
File:
PDF, 187 KB
english, 1987
42

Living With an Ostomy and Short Bowel Syndrome

Year:
2001
Language:
english
File:
PDF, 113 KB
english, 2001
46

An optimal parallel adaptive sorting algorithm

Year:
1991
Language:
english
File:
PDF, 644 KB
english, 1991